Polynomial-time algorithm for vertex k-colorability of P_5-free graphs
نویسندگان
چکیده
We give the first polynomial-time algorithm for coloring vertices of P5free graphs with k colors. This settles an open problem and generalizes several previously known results. Page 2 RRR 2006 21
منابع مشابه
Vertex 3-colorability of Claw-free Graphs
The 3-colorability problem is NP-complete in the class of clawfree graphs and it remains hard in many of its subclasses obtained by forbidding additional subgraphs. (Line graphs and claw-free graphs of vertex degree at most four provide two examples.) In this paper we study the computational complexity of the 3-colorability problem in subclasses of claw-free graphs defined by finitely many forb...
متن کاملOn colouring (2P2, H)-free and (P5, H)-free graphs
The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no induced subgraph isomorphic to $H_1$ or $H_2$. A connected graph $H_1$ is almost classified if Colouring on $(H_1,H_2)$-free graphs is known to be polynomial-time ...
متن کاملConnected Vertex Cover for (sP1+P5)-Free Graphs
The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most $k$ that induces a connected subgraph of $G$. This is a well-studied problem, known to be NP-complete for restricted graph classes, and, in particular, for $H$-free graphs if $H$ is not a linear forest (a graph is $H$-free if it does not contain $H$ as an induced subgraph). It is easy to see that Con...
متن کاملThe coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial
We show that determining the chromatic number of a {P 5 , P 5 }-free graph or a {P 5 , K p − e}-free graph can be done in polynomial time.
متن کاملColoring ($P_5$, bull)-free graphs
We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices a, b, c, d, e and edges ab, bc, cd, be, ce).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0607115 شماره
صفحات -
تاریخ انتشار 2006